State space reduction for process algebra specifications
نویسندگان
چکیده
منابع مشابه
State Space Reduction for Dynamic Process Creation
Automated veri cation of dynamic multi-threaded computing systems is severely a ected by problems relating to dynamic process creation. In this paper, we describe an abstraction technique aimed at generating reduced state space representations for such systems. To make the new technique applicable to a wide range of di erent system models, we express it in terms of general labelled transition s...
متن کاملEquivalence of recursive specifications in process algebra
We define an equivalence relation on recursive specifications in process algebra that is model-independent and does not involve an explicit notion of solution. Then we extend this equivalence to the specification language μCRL. 2001 Elsevier Science B.V. All rights reserved.
متن کاملSpecifications in Stochastic Process Algebra for a Robot Control Problem
We present a novel approach to specification of dynamic systems. This approach, a stochastic extension of process algebra, facilitates quantitative, or performance, analysis, in addition to qualitative analysis. For unreliable systems this integrated approach encourages the investigation of the impact of functional characteristics on the performance of the system. Throughout the paper details o...
متن کاملReachable state space analysis of LOTOS specifications
We present a symbolic analysis technique for Lotos programs with integer variables on which only linear expressions are allowed. The technique is applicable to models generated by the Lotos compiler of the CCsar-Ald ebaran toolbox which are Petri nets extended with guarded commands. It allows to compute a predicate on variables characterizing the set of the reachable states or an upper approxim...
متن کاملModule Algebra for Relational Specifications
Module algebra is described as a parametrised data type that takes a three sorted parameter, involving signatures, renamings and atomic specifications. An actual parameter describing relational specifications is given and a biinterpretation model is made for the resulting specification. 1986 CR Categories: D.2.0 [software engineering]: requirements/ specificationslanguages; D.2.2 [software engi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2006
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2005.09.064